1299. Replace Elements with Greatest Element on Right Side - LeetCode Solution

class Solution:
    def replaceElements(self, arr: List[int]) -> List[int]:
        if len(arr) == 1:
            return [-1]
        
        a = []
        for i in range(1, len(arr)):
            a.append(max(arr[i:]))
        
        a.append(-1)
        return a